Entropic Nonextensivity as a Measure of Time Series Complexity
نویسنده
چکیده
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the trajectory manifold, and the entropy of the globally linearized manifold. When the entropies are Tsallis entropies the complexity is characterized by the value of q.
منابع مشابه
A Novel Method for Detection of Epilepsy in Short and Noisy EEG Signals Using Ordinal Pattern Analysis
Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...
متن کاملMeasurement of Complexity and Comprehension of a Program Through a Cognitive Approach
The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...
متن کاملNonextensivity and multifractality in low-dimensional dissipative systems
Power-law sensitivity to initial conditions at the edge of chaos provides a natural relation between the scaling properties of the dynamics attractor and its degree of nonextensivity as prescribed in the generalized statistics recently introduced by one of us (C.T.) and characterized by the entropic index q. We show that general scaling arguments imply that 1/(1−q) = 1/αmin−1/αmax, where αmin a...
متن کاملComplexity Through Nonextensivity
The problem of defining and studying complexity of a time series has interested people for years. In the context of dynamical systems, Grassberger has suggested that a slow approach of the entropy to its extensive asymptotic limit is a sign of complexity. We investigate this idea further by information theoretic and statistical mechanics techniques and show that these arguments can be made prec...
متن کاملar X iv : a st ro - p h / 04 03 47 2 v 1 1 9 M ar 2 00 4 Nonextensivity and Galaxy Clustering in the Universe
We investigate two important questions about the use of the nonextensive thermo-statistics (NETS) formalism in the context of nonlinear galaxy clustering in the Universe. Firstly, we define a quantitative criterion for justifying nonextensivity at different physical scales. Then, we discuss the physics behind the ansatz of the entropic parameter q(r). Our results suggest the approximate range w...
متن کامل